TSTP Solution File: ANA095^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ANA095^1 : TPTP v8.2.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 18:40:28 EDT 2024
% Result : Theorem 0.13s 0.37s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 19
% Syntax : Number of formulae : 45 ( 13 unt; 14 typ; 0 def)
% Number of atoms : 262 ( 73 equ; 0 cnn)
% Maximal formula atoms : 8 ( 8 avg)
% Number of connectives : 566 ( 37 ~; 22 |; 29 &; 467 @)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 81 ( 81 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 2 con; 0-5 aty)
% Number of variables : 74 ( 0 ^ 54 !; 12 ?; 74 :)
% ( 8 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_6,type,
'type/realax/real': $tType ).
thf(type_def_7,type,
sK0: $tType ).
thf(func_def_0,type,
'type/realax/real': $tType ).
thf(func_def_1,type,
'const/sets/UNION':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 > $o ) ).
thf(func_def_2,type,
'const/sets/FINITE':
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_3,type,
'const/sets/DISJOINT':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > $o ) ).
thf(func_def_4,type,
'const/realax/real_add': 'type/realax/real' > 'type/realax/real' > 'type/realax/real' ).
thf(func_def_5,type,
'const/iterate/sum':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > 'type/realax/real' ) > 'type/realax/real' ) ).
thf(func_def_6,type,
'const/iterate/monoidal':
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > $o ) ).
thf(func_def_7,type,
'const/iterate/iterate':
!>[X0: $tType,X1: $tType] : ( ( X1 > X1 > X1 ) > ( X0 > $o ) > ( X0 > X1 ) > X1 ) ).
thf(func_def_11,type,
sK1: sK0 > 'type/realax/real' ).
thf(func_def_12,type,
sK2: sK0 > $o ).
thf(func_def_13,type,
sK3: sK0 > $o ).
thf(func_def_15,type,
ph5:
!>[X0: $tType] : X0 ).
thf(f32,plain,
$false,
inference(subsumption_resolution,[],[f31,f20]) ).
thf(f20,plain,
( ( 'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add' )
= $true ),
inference(cnf_transformation,[],[f10]) ).
thf(f10,plain,
( ( 'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add' )
= $true ),
inference(fool_elimination,[],[f9]) ).
thf(f9,plain,
'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add',
inference(rectify,[],[f3]) ).
thf(f3,axiom,
'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add',
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/iterate/MONOIDAL_REAL_ADD_') ).
thf(f31,plain,
( ( 'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add' )
!= $true ),
inference(subsumption_resolution,[],[f30,f23]) ).
thf(f23,plain,
( ( 'const/sets/FINITE' @ sK0 @ sK2 )
= $true ),
inference(cnf_transformation,[],[f18]) ).
thf(f18,plain,
( ( $true
= ( 'const/sets/DISJOINT' @ sK0 @ sK2 @ sK3 ) )
& ( ( 'const/sets/FINITE' @ sK0 @ sK2 )
= $true )
& ( ( 'const/sets/FINITE' @ sK0 @ sK3 )
= $true )
& ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ sK0 @ sK2 @ sK1 ) @ ( 'const/iterate/sum' @ sK0 @ sK3 @ sK1 ) )
!= ( 'const/iterate/sum' @ sK0 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) @ sK1 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f14,f17]) ).
thf(f17,plain,
( ? [X0: $tType,X1: X0 > 'type/realax/real',X2: X0 > $o,X3: X0 > $o] :
( ( ( 'const/sets/DISJOINT' @ X0 @ X2 @ X3 )
= $true )
& ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true )
& ( ( 'const/sets/FINITE' @ X0 @ X3 )
= $true )
& ( ( 'const/iterate/sum' @ X0 @ ( 'const/sets/UNION' @ X0 @ X2 @ X3 ) @ X1 )
!= ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X2 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) ) ) )
=> ( ( $true
= ( 'const/sets/DISJOINT' @ sK0 @ sK2 @ sK3 ) )
& ( ( 'const/sets/FINITE' @ sK0 @ sK2 )
= $true )
& ( ( 'const/sets/FINITE' @ sK0 @ sK3 )
= $true )
& ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ sK0 @ sK2 @ sK1 ) @ ( 'const/iterate/sum' @ sK0 @ sK3 @ sK1 ) )
!= ( 'const/iterate/sum' @ sK0 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) @ sK1 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f14,plain,
? [X0: $tType,X1: X0 > 'type/realax/real',X2: X0 > $o,X3: X0 > $o] :
( ( ( 'const/sets/DISJOINT' @ X0 @ X2 @ X3 )
= $true )
& ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true )
& ( ( 'const/sets/FINITE' @ X0 @ X3 )
= $true )
& ( ( 'const/iterate/sum' @ X0 @ ( 'const/sets/UNION' @ X0 @ X2 @ X3 ) @ X1 )
!= ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X2 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) ) ) ),
inference(flattening,[],[f13]) ).
thf(f13,plain,
? [X0: $tType,X1: X0 > 'type/realax/real',X2: X0 > $o,X3: X0 > $o] :
( ( ( 'const/iterate/sum' @ X0 @ ( 'const/sets/UNION' @ X0 @ X2 @ X3 ) @ X1 )
!= ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X2 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) ) )
& ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true )
& ( ( 'const/sets/FINITE' @ X0 @ X3 )
= $true )
& ( ( 'const/sets/DISJOINT' @ X0 @ X2 @ X3 )
= $true ) ),
inference(ennf_transformation,[],[f12]) ).
thf(f12,plain,
~ ! [X0: $tType,X1: X0 > 'type/realax/real',X2: X0 > $o,X3: X0 > $o] :
( ( ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true )
& ( ( 'const/sets/FINITE' @ X0 @ X3 )
= $true )
& ( ( 'const/sets/DISJOINT' @ X0 @ X2 @ X3 )
= $true ) )
=> ( ( 'const/iterate/sum' @ X0 @ ( 'const/sets/UNION' @ X0 @ X2 @ X3 ) @ X1 )
= ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X2 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) ) ) ),
inference(fool_elimination,[],[f11]) ).
thf(f11,plain,
~ ! [X0: $tType,X1: X0 > 'type/realax/real',X2: X0 > $o,X3: X0 > $o] :
( ( ( 'const/sets/FINITE' @ X0 @ X3 )
& ( 'const/sets/DISJOINT' @ X0 @ X2 @ X3 )
& ( 'const/sets/FINITE' @ X0 @ X2 ) )
=> ( ( 'const/iterate/sum' @ X0 @ ( 'const/sets/UNION' @ X0 @ X2 @ X3 ) @ X1 )
= ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X2 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f5,negated_conjecture,
~ ! [X0: $tType,X1: X0 > 'type/realax/real',X2: X0 > $o,X3: X0 > $o] :
( ( ( 'const/sets/FINITE' @ X0 @ X3 )
& ( 'const/sets/DISJOINT' @ X0 @ X2 @ X3 )
& ( 'const/sets/FINITE' @ X0 @ X2 ) )
=> ( ( 'const/iterate/sum' @ X0 @ ( 'const/sets/UNION' @ X0 @ X2 @ X3 ) @ X1 )
= ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X2 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) ) ) ),
inference(negated_conjecture,[],[f4]) ).
thf(f4,conjecture,
! [X0: $tType,X1: X0 > 'type/realax/real',X2: X0 > $o,X3: X0 > $o] :
( ( ( 'const/sets/FINITE' @ X0 @ X3 )
& ( 'const/sets/DISJOINT' @ X0 @ X2 @ X3 )
& ( 'const/sets/FINITE' @ X0 @ X2 ) )
=> ( ( 'const/iterate/sum' @ X0 @ ( 'const/sets/UNION' @ X0 @ X2 @ X3 ) @ X1 )
= ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X2 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/iterate/SUM_UNION_') ).
thf(f30,plain,
( ( ( 'const/sets/FINITE' @ sK0 @ sK2 )
!= $true )
| ( ( 'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add' )
!= $true ) ),
inference(subsumption_resolution,[],[f29,f24]) ).
thf(f24,plain,
( $true
= ( 'const/sets/DISJOINT' @ sK0 @ sK2 @ sK3 ) ),
inference(cnf_transformation,[],[f18]) ).
thf(f29,plain,
( ( $true
!= ( 'const/sets/DISJOINT' @ sK0 @ sK2 @ sK3 ) )
| ( ( 'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add' )
!= $true )
| ( ( 'const/sets/FINITE' @ sK0 @ sK2 )
!= $true ) ),
inference(subsumption_resolution,[],[f28,f22]) ).
thf(f22,plain,
( ( 'const/sets/FINITE' @ sK0 @ sK3 )
= $true ),
inference(cnf_transformation,[],[f18]) ).
thf(f28,plain,
( ( ( 'const/sets/FINITE' @ sK0 @ sK3 )
!= $true )
| ( $true
!= ( 'const/sets/DISJOINT' @ sK0 @ sK2 @ sK3 ) )
| ( ( 'const/sets/FINITE' @ sK0 @ sK2 )
!= $true )
| ( ( 'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add' )
!= $true ) ),
inference(trivial_inequality_removal,[],[f27]) ).
thf(f27,plain,
( ( ( 'const/sets/FINITE' @ sK0 @ sK2 )
!= $true )
| ( ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) @ sK1 )
!= ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) @ sK1 ) )
| ( $true
!= ( 'const/sets/DISJOINT' @ sK0 @ sK2 @ sK3 ) )
| ( ( 'const/sets/FINITE' @ sK0 @ sK3 )
!= $true )
| ( ( 'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add' )
!= $true ) ),
inference(superposition,[],[f26,f25]) ).
thf(f25,plain,
! [X1: $tType,X0: $tType,X2: X1 > X1 > X1,X3: X0 > X1,X4: X0 > $o,X5: X0 > $o] :
( ( ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/UNION' @ X0 @ X4 @ X5 ) @ X3 )
= ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X3 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X5 @ X3 ) ) )
| ( ( 'const/iterate/monoidal' @ X1 @ X2 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X5 )
!= $true )
| ( ( 'const/sets/DISJOINT' @ X0 @ X4 @ X5 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X4 )
!= $true ) ),
inference(cnf_transformation,[],[f16]) ).
thf(f16,plain,
! [X0: $tType,X1: $tType,X2: X1 > X1 > X1] :
( ( ( 'const/iterate/monoidal' @ X1 @ X2 )
!= $true )
| ! [X3: X0 > X1,X4: X0 > $o,X5: X0 > $o] :
( ( ( 'const/sets/DISJOINT' @ X0 @ X4 @ X5 )
!= $true )
| ( ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/UNION' @ X0 @ X4 @ X5 ) @ X3 )
= ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X3 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X5 @ X3 ) ) )
| ( ( 'const/sets/FINITE' @ X0 @ X5 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X4 )
!= $true ) ) ),
inference(flattening,[],[f15]) ).
thf(f15,plain,
! [X0: $tType,X1: $tType,X2: X1 > X1 > X1] :
( ! [X3: X0 > X1,X4: X0 > $o,X5: X0 > $o] :
( ( ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/UNION' @ X0 @ X4 @ X5 ) @ X3 )
= ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X3 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X5 @ X3 ) ) )
| ( ( 'const/sets/DISJOINT' @ X0 @ X4 @ X5 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X4 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X5 )
!= $true ) )
| ( ( 'const/iterate/monoidal' @ X1 @ X2 )
!= $true ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f8,plain,
! [X0: $tType,X1: $tType,X2: X1 > X1 > X1] :
( ( ( 'const/iterate/monoidal' @ X1 @ X2 )
= $true )
=> ! [X3: X0 > X1,X4: X0 > $o,X5: X0 > $o] :
( ( ( ( 'const/sets/DISJOINT' @ X0 @ X4 @ X5 )
= $true )
& ( ( 'const/sets/FINITE' @ X0 @ X4 )
= $true )
& ( ( 'const/sets/FINITE' @ X0 @ X5 )
= $true ) )
=> ( ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/UNION' @ X0 @ X4 @ X5 ) @ X3 )
= ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X3 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X5 @ X3 ) ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f7,plain,
! [X0: $tType,X1: $tType,X2: X1 > X1 > X1] :
( ( 'const/iterate/monoidal' @ X1 @ X2 )
=> ! [X3: X0 > X1,X4: X0 > $o,X5: X0 > $o] :
( ( ( 'const/sets/FINITE' @ X0 @ X5 )
& ( 'const/sets/DISJOINT' @ X0 @ X4 @ X5 )
& ( 'const/sets/FINITE' @ X0 @ X4 ) )
=> ( ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/UNION' @ X0 @ X4 @ X5 ) @ X3 )
= ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X3 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X5 @ X3 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
! [X0: $tType,X1: $tType,X2: X1 > X1 > X1] :
( ( 'const/iterate/monoidal' @ X1 @ X2 )
=> ! [X3: X0 > X1,X4: X0 > $o,X5: X0 > $o] :
( ( ( 'const/sets/FINITE' @ X0 @ X5 )
& ( 'const/sets/DISJOINT' @ X0 @ X4 @ X5 )
& ( 'const/sets/FINITE' @ X0 @ X4 ) )
=> ( ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/UNION' @ X0 @ X4 @ X5 ) @ X3 )
= ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X3 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X5 @ X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/iterate/ITERATE_UNION_') ).
thf(f26,plain,
( ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) @ sK1 )
!= ( 'const/realax/real_add' @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK2 @ sK1 ) @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK3 @ sK1 ) ) ),
inference(definition_unfolding,[],[f21,f19,f19,f19]) ).
thf(f19,plain,
! [X0: $tType] :
( 'const/iterate/sum'
@ ( X0
= ( 'const/iterate/iterate' @ X0 @ 'type/realax/real' @ 'const/realax/real_add' ) ) ),
inference(cnf_transformation,[],[f1]) ).
thf(f1,axiom,
! [X0: $tType] :
( 'const/iterate/sum'
@ ( X0
= ( 'const/iterate/iterate' @ X0 @ 'type/realax/real' @ 'const/realax/real_add' ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/iterate/sum_') ).
thf(f21,plain,
( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ sK0 @ sK2 @ sK1 ) @ ( 'const/iterate/sum' @ sK0 @ sK3 @ sK1 ) )
!= ( 'const/iterate/sum' @ sK0 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) @ sK1 ) ),
inference(cnf_transformation,[],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ANA095^1 : TPTP v8.2.0. Released v7.0.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.34 % Computer : n012.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 07:48:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH1_THM_EQU_NAR problem
% 0.13/0.35 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.36 % (16683)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.13/0.37 % (16680)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.37 % (16679)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (2999ds/27Mi)
% 0.13/0.37 % (16678)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.13/0.37 % (16682)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2999ds/275Mi)
% 0.13/0.37 % (16681)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.37 % (16680)Instruction limit reached!
% 0.13/0.37 % (16680)------------------------------
% 0.13/0.37 % (16680)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (16680)Termination reason: Unknown
% 0.13/0.37 % (16680)Termination phase: Preprocessing 3
% 0.13/0.37 % (16681)Instruction limit reached!
% 0.13/0.37 % (16681)------------------------------
% 0.13/0.37 % (16681)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (16681)Termination reason: Unknown
% 0.13/0.37 % (16681)Termination phase: shuffling
% 0.13/0.37
% 0.13/0.37 % (16681)Memory used [KB]: 895
% 0.13/0.37 % (16681)Time elapsed: 0.002 s
% 0.13/0.37 % (16681)Instructions burned: 2 (million)
% 0.13/0.37 % (16681)------------------------------
% 0.13/0.37 % (16681)------------------------------
% 0.13/0.37
% 0.13/0.37 % (16680)Memory used [KB]: 895
% 0.13/0.37 % (16680)Time elapsed: 0.003 s
% 0.13/0.37 % (16680)Instructions burned: 2 (million)
% 0.13/0.37 % (16680)------------------------------
% 0.13/0.37 % (16680)------------------------------
% 0.13/0.37 % (16677)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.13/0.37 % (16684)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.13/0.37 % (16678)Instruction limit reached!
% 0.13/0.37 % (16678)------------------------------
% 0.13/0.37 % (16678)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (16678)Termination reason: Unknown
% 0.13/0.37 % (16678)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (16678)Memory used [KB]: 5500
% 0.13/0.37 % (16678)Time elapsed: 0.004 s
% 0.13/0.37 % (16678)Instructions burned: 4 (million)
% 0.13/0.37 % (16678)------------------------------
% 0.13/0.37 % (16678)------------------------------
% 0.13/0.37 % (16682)First to succeed.
% 0.13/0.37 % (16684)Instruction limit reached!
% 0.13/0.37 % (16684)------------------------------
% 0.13/0.37 % (16684)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (16684)Termination reason: Unknown
% 0.13/0.37 % (16684)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (16684)Memory used [KB]: 5500
% 0.13/0.37 % (16684)Time elapsed: 0.003 s
% 0.13/0.37 % (16684)Instructions burned: 3 (million)
% 0.13/0.37 % (16684)------------------------------
% 0.13/0.37 % (16684)------------------------------
% 0.13/0.37 % (16683)Also succeeded, but the first one will report.
% 0.13/0.37 % (16679)Also succeeded, but the first one will report.
% 0.13/0.37 % (16682)Refutation found. Thanks to Tanya!
% 0.13/0.37 % SZS status Theorem for theBenchmark
% 0.13/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.37 % (16682)------------------------------
% 0.13/0.37 % (16682)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (16682)Termination reason: Refutation
% 0.13/0.37
% 0.13/0.37 % (16682)Memory used [KB]: 5500
% 0.13/0.37 % (16682)Time elapsed: 0.006 s
% 0.13/0.37 % (16682)Instructions burned: 4 (million)
% 0.13/0.37 % (16682)------------------------------
% 0.13/0.37 % (16682)------------------------------
% 0.13/0.37 % (16676)Success in time 0.007 s
% 0.13/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------